Spatial Query Optimization Utilizing Early Separated Filter and Refinement Strategy
نویسندگان
چکیده
| Due to the high complexity and large volume of spatial data, a spatial query is usually processed in two steps, called the lter step and the re nement step. However, the two-step processing of the spatial query has been considered locally in one spatial predicate evaluation at the query execution level. This paper presents query optimization strategies which exploit the two-step processing of a spatial query at the query optimization level. The rst strategy involves the separation of lter and re nement steps not in the query execution phase but in the query optimization phase. As the second strategy, several re nement operations can be combined in processing a complex query if they were already separated, and as the third strategy several lter operations can also be combined. We call the optimization technique utilizing these strategies the Early Separated Filter And Re nement (ESFAR). This paper also presents an algebra, which is called the Intermediate Spatial Object Algebra (ISOA), and optimization rules for ESFAR. Through experiments using real data, we compare the ESFAR optimization technique with a traditional optimization technique which does not separate lter and re nement steps from the query optimization phase. The experimental results show that the ESFAR optimization technique generates more e cient query execution plans than the traditional one in many cases. c 2000 Elsevier Science Ltd. All rights reserved
منابع مشابه
Early Separation of Filter and Refinement Steps in Spatial Query Optimization
The spatial query has been processed in two steps, the filter step and the refinement step, due to a large volume and high complexity of the spatial data. However, this approach has been considered only in the query execution phase after completing the query optimization phase. This paper presents query optimization strategies which take the characteristics of spatial databases into account. Th...
متن کاملSpatial Query Optimization Utilizingearly Separated Filter and Refinement
| Due to the high complexity and large volume of spatial data, a spatial query has been processed in two steps, called the lter step and the reenement step. However, the two-step processing of the spatial query has been considered locally in one spatial predicate evaluation at the query execution level. This paper presents query optimization strategies which exploit the two-step processing of a...
متن کاملSeparation of Filter and Refinement Steps in Spatial Query Optimization
Recently, the research on spatial database systems has actively progressed because the applications using the spatial information such as geographic information systems, computer aided design and multimedia systems, have been increased. However, most of the research dealt with only a part of spatial database systems such as data models, spatial indexes, or spatial join algorithms. There was a l...
متن کاملEarly Separation of Filter and Re nement
The spatial query has been processed in two steps, the lter step and the reenement step, due to a large volume and high complexity of the spatial data. However, this approach has been considered only in the query execution phase after completing the query optimization phase. This paper presents query optimization strategies which take the characteristics of spatial databases into account. The r...
متن کاملSelective Scan for Filter Operator of SciDB
Recently there has been an increasing interest in analyzing scientific data generated by observations and scientific experiments. For managing these data efficiently, SciDB, a multi-dimensional array-based DBMS, is suggested. When SciDB processes a query with where predicates, it uses filter operator internally to produce a result array that matches the predicates. Most queries for scientific d...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Inf. Syst.
دوره 25 شماره
صفحات -
تاریخ انتشار 2000